DE eng

Search in the Catalogues and Directories

Page: 1 2
Hits 1 – 20 of 29

1
Categorial Dependency Grammars: Analysis and Learning (Invited Talk)
In: Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021) ; https://hal.archives-ouvertes.fr/hal-03527581 ; Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021), Dec 2021, Montpellier, France (2021)
BASE
Show details
2
On Categorial Grammatical Inference and Logical Information Systems
In: Logic and Algorithms in Computational Linguistics 2018, Series: Advances in Intelligent Systems and Computing, Volume 860 ; https://hal.inria.fr/hal-02462675 ; Logic and Algorithms in Computational Linguistics 2018, Series: Advances in Intelligent Systems and Computing, Volume 860, pp.125-153, 2019, ⟨10.1007/978-3-030-30077-7_6⟩ (2019)
BASE
Show details
3
Simple K-star Categorial Dependency Grammars and their Inference
In: The 13th International Conference on Grammatical Inference (ICGI) ; https://hal.archives-ouvertes.fr/hal-01363393 ; The 13th International Conference on Grammatical Inference (ICGI), Oct 2016, Delft, Netherlands ; http://icgi2016.tudelft.nl/ (2016)
BASE
Show details
4
Categorial Dependency Grammars with Iterated Sequences
In: 9th International Conference, LACL 2016 ; https://hal.archives-ouvertes.fr/hal-01424957 ; 9th International Conference, LACL 2016, Dec 2016, Nancy, France. pp.34-51, ⟨10.1007/978-3-662-53826-5_3⟩ (2016)
BASE
Show details
5
Validation Issues induced by an Automatic Pre-Annotation Mechanism in the Building of Non-projective Dependency Treebanks
In: Proceedings of the Ninth International Conference on Language Ressources and Evaluation (LREC 2014), Reykjavik, Iceland, May 26-31, 2014 ; Ninth International Conference on Language Ressources and Evaluation (LREC 2014) ; https://hal.archives-ouvertes.fr/hal-01017233 ; Ninth International Conference on Language Ressources and Evaluation (LREC 2014), May 2014, Reykjavik, Iceland. pp.4082-4086 (2014)
BASE
Show details
6
NP-Completeness of Grammars Based upon Products of Free Pregroups
In: Categories and Types in Logic, Language, and Physics, Essays Dedicated to Jim Lambek on the Occasion of His 90th Birthday ; https://hal.archives-ouvertes.fr/hal-00993347 ; Claudia Casadio, Bob Coecke, Michael Moortgat and Philip Scott. Categories and Types in Logic, Language, and Physics, Essays Dedicated to Jim Lambek on the Occasion of His 90th Birthday, Springer-Verlag, pp.51-62, 2014, Lecture Notes in Computer Science, LNCS 8222, 978-3-642-54788-1. ⟨10.1007/978-3-642-54789-8⟩ (2014)
BASE
Show details
7
Label Pre-annotation for Building Non-projective Dependency Treebanks for French
In: 15th International Conference on Computational Linguistics and Intelligent Text Processing (CICLing 2014) ; https://hal.archives-ouvertes.fr/hal-01004007 ; 15th International Conference on Computational Linguistics and Intelligent Text Processing (CICLing 2014), Apr 2014, Kathmandu, Nepal. pp.1-12 (2014)
BASE
Show details
8
A Three-Step Transition-Based System for Non-Projective Dependency Parsing
In: The 25th International Conference on Computational Linguistics (COLING 2014) ; https://hal.archives-ouvertes.fr/hal-01097232 ; The 25th International Conference on Computational Linguistics (COLING 2014), Aug 2014, Dublin, Ireland. pp.224-232 ; http://aclweb.org/anthology/C/C14/C14-1023.pdf (2014)
BASE
Show details
9
Logical Aspects of Computational Linguistics : 7th International Conference, LACL 2012, Nantes, France, July 2-4, 2012, Proceedings
Bechet, Denis; Dikovsky, Alexandre. - Berlin, Heidelberg : Springer Berlin Heidelberg, 2012
UB Frankfurt Linguistik
Show details
10
Categorial grammars with iterated types form a strict hierarchy of k-valued languages
In: ISSN: 1879-2294 ; EISSN: 0304-3975 ; Theoretical Computer Science ; https://hal.archives-ouvertes.fr/hal-00821823 ; Theoretical Computer Science, Elsevier, 2012, 450, pp.22-30. ⟨10.1016/j.tcs.2012.04.024⟩ (2012)
BASE
Show details
11
On the Adequacy of Three POS Taggers and a Dependency Parser
In: 13th International Conference on Computational Linguistics and Intelligent Text Processing ; https://hal.archives-ouvertes.fr/hal-00820227 ; 13th International Conference on Computational Linguistics and Intelligent Text Processing, Mar 2012, New Delhi, India. pp.104-116 (2012)
BASE
Show details
12
Logical Aspects of Computational Linguistics, 7th International Conference, LACL 2012, Nantes, France, July 2-4, 2012, Proceedings
Béchet, Denis; Dikovsky, Alexander. - : HAL CCSD, 2012. : Springer-Verlag, 2012
In: https://hal.archives-ouvertes.fr/hal-00820230 ; France. Springer-Verlag, pp.249, 2012, 978-3-642-31261-8. ⟨10.1007/978-3-642-31262-5⟩ (2012)
BASE
Show details
13
Non-projective Axioms for Pregroup Grammars as Cut Eliminations
In: Workshop Joachim Lambek, Mathematics, Logic and Language ; https://hal.archives-ouvertes.fr/hal-00820218 ; Workshop Joachim Lambek, Mathematics, Logic and Language, Jul 2011, Chieti, Italy (2011)
BASE
Show details
14
Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages
In: 16th International Conference on Implementation and Application of Automata ; https://hal.archives-ouvertes.fr/hal-00820210 ; 16th International Conference on Implementation and Application of Automata, Jul 2011, Blois, France. pp.42-52, ⟨10.1007/978-3-642-22256-6⟩ (2011)
BASE
Show details
15
CDG Lab: a Toolbox for Dependency Grammars and Dependency Treebanks Development
In: 1st International Conference on Dependency Linguistics (Depling 2011) ; https://hal.archives-ouvertes.fr/hal-00820213 ; 1st International Conference on Dependency Linguistics (Depling 2011), Sep 2011, Barcelona, Spain. Short paper (2011)
BASE
Show details
16
On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types
In: 6th International Conference on Logical Aspects of Computational Linguistics ; https://hal.archives-ouvertes.fr/hal-00820207 ; 6th International Conference on Logical Aspects of Computational Linguistics, Jun 2011, Montpellier, France. pp.80-95, ⟨10.1007/978-3-642-22221-4⟩ (2011)
BASE
Show details
17
A pregroup toolbox for parsing and building grammars of natural languages
In: Linguistic analysis. - Vashon Island, Wash. : Linguistic Analysis 36 (2006) 1-4, 473-482
BLLDB
OLC Linguistik
Show details
18
A Pregroup Toolbox for Parsing and Building Grammars of Natural Languages
In: ISSN: 0098-9053 ; Linguistic Analysis ; https://hal.archives-ouvertes.fr/hal-00820204 ; Linguistic Analysis, David R. Willingham, 2010, 36 (1-4), pp.473-482 (2010)
BASE
Show details
19
Introduction of option and iteration into pregroup grammars
In: Computational algebraic approaches to natural language. - Monza (Milano) : Polimetrica (2008), 85-107
BLLDB
Show details
20
Fully Lexicalized Pregroup Grammars
In: Logic, Language, Information and Computation, 14th International Workshop, WoLLIC 2007, Rio de Janeiro, Brazil, July 2007, Proceedings ; 14th International Workshop, WoLLIC 2007 ; https://hal.archives-ouvertes.fr/hal-00471915 ; 14th International Workshop, WoLLIC 2007, 2007, Brazil. pp.12--25 (2007)
Abstract: International audience ; Pregroup grammars are a context-free grammar formalism introduced as a simplification of Lambek calculus. This formalism is interesting for several reasons: the syntactical properties of words are specified by a set of types like the other type-based grammar formalisms ; as a logical model, compositionality is easy ; a polytime parsing algorithm exists. However, this formalism is not completely lexicalized because each pregroup grammar is based on the free pregroup built from a set of primitive types together with a partial order, and this order is not lexical information. In fact, only the pregroup grammars that are based on primitive types with an order that is equality can be seen as fully lexicalized. We show here how we can transform, using a morphism on types, a particular pregroup grammar into another pregroup grammar that uses the equality as the order on primitive types. This transformation is at most quadratic in size (linear for a fixed set of primitive types), it preserves the parse structures of sentences and the number of types assigned to a word.
Keyword: [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]; [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing
URL: https://hal.archives-ouvertes.fr/hal-00471915
BASE
Hide details

Page: 1 2

Catalogues
1
0
2
0
0
0
0
Bibliographies
4
0
0
0
0
0
0
0
1
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
22
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern